Spectral flow and intersection number

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Spectral flow and winding number in von Neumann algebras

We define a new topology, weaker than the gap topology, on the space of selfadjoint operators affiliated to a semifinite von Neumann algebra and define the real-valued spectral flow for a continuous path of selfadjoint Breuer-Fredholm operators in terms of a generalization of the winding number. We compare our definition with Phillips’ analytical definition. Furthermore we prove the homotopy in...

متن کامل

Spectral Flow as Winding Number and Integral Formulas

A general integral formula for the spectral flow of a path of unbounded selfadjoint Fredholm operators subject to certain summability conditions is derived from the interpretation of the spectral flow as a winding number.

متن کامل

Some lower bounds for the $L$-intersection number of graphs

‎For a set of non-negative integers~$L$‎, ‎the $L$-intersection number of a graph is the smallest number~$l$ for which there is an assignment of subsets $A_v subseteq {1,dots‎, ‎l}$ to vertices $v$‎, ‎such that every two vertices $u,v$ are adjacent if and only if $|A_u cap A_v|in L$‎. ‎The bipartite $L$-intersection number is defined similarly when the conditions are considered only for the ver...

متن کامل

Spectral Methods for Intersection Problems

3 Spectral Method 5 3.1 A Fourier Transform . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5 3.2 Toy Example . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7 3.3 General Method . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 8 3.4 Color agreement problems . . . . . . . . . . . . ....

متن کامل

Chromatic number and spectral radius

Write (A) = 1 (A) min (A) for the eigenvalues of a Hermitian matrix A. Our main result is: let A be a Hermitian matrix partitioned into r r blocks so that all diagonal blocks are zero. Then for every real diagonal matrix B of the same size as A; (B A) B + 1 r 1 : Let G be a nonempty graph, (G) be its chromatic number, A be its adjacency matrix, and L be its Laplacian. The above inequality impli...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Kyoto Journal of Mathematics

سال: 1993

ISSN: 2156-2261

DOI: 10.1215/kjm/1250519347